Laplacians of Covering Complexes
نویسنده
چکیده
The Laplace operator on a simplicial complex encodes information about the adjacencies between simplices. A relationship between simplicial complexes does not always translate to a relationship between their Laplacians. In this paper we look at the case of covering complexes. A covering of a simplicial complex is built from many copies of simplices of the original complex, maintaining the adjacency relationships between simplices. We show that for dimension at least one, the Laplacian spectrum of a simplicial complex is contained inside the Laplacian spectrum of any of its covering complexes. Acknowledgements: This research was conducted at Canisius College with funding by the NSF. The author would like to thank Dr. Terrence Bisson for his contributions. Page 2 RHIT Undergrad. Math. J., Vol. 12, no. 1
منابع مشابه
Eigenvalue Bracketing for Discrete and Metric Graphs
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph spectrum (also in the “exceptional” values of the metric graph corresponding to the Dirichlet spectrum) we carry over these estimates from the metric graph La...
متن کاملLaplacians on Shifted Multicomplexes
The Laplacian of an undirected graph is a square matrix, whose eigenvalues yield important information. We can regard graphs as one-dimensional simplicial complexes, and as whether there is a generalisation of the Laplacian operator to simplicial complexes. It turns out that there is, and that is useful for calculating real Betti numbers [8]. Duval and Reiner [5] have studied Laplacians of a sp...
متن کاملWeighted Tree-Numbers of Matroid Complexes
We give a new formula for the weighted high-dimensional tree-numbers of matroid complexes. This formula is derived from our result that the spectra of the weighted combinatorial Laplacians of matroid complexes consist of polynomials in the weights. In the formula, Crapo’s β-invariant appears as the key factor relating weighted combinatorial Laplacians and weighted tree-numbers for matroid compl...
متن کاملSolving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball
Abstract We present an e cient algorithm for solving a linear system arising from the 1-Laplacian of a collapsible simplicial complex with a known collapsing sequence. When combined with a result of Chillingworth, our algorithm is applicable to convex simplicial complexes embedded in R. The running time of our algorithm is nearly-linear in the size of the complex and is logarithmic on its numer...
متن کاملPerformance Analysis of Graph Laplacian Matrices in Detecting Protein Complexes
Detecting protein complexes is an important way to discover the relationship between network topological structure and its functional features in protein-protein interaction (PPI) network. The spectral clustering method is a popular approach. However, how to select its optimal Laplacian matrix is still an open problem. Here, we analyzed the performances of three graph Laplacian matrices (unnorm...
متن کامل